Cut generation for an integrated employee timetabling and production scheduling problem
نویسندگان
چکیده
منابع مشابه
Cut generation for an integrated employee timetabling and production scheduling problem
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At the second level, we aim at supplying a feasible production schedule for a set of interruptible tasks with qualification requirements and time-windows. Instead of hierarchically solving these two problems as in the cur...
متن کاملCut generation for an employee timetabling problem
Motivated by an industrial application, we study a specific employee timetabling problem. Several investigations are being conducted: a lower bound by Lagrangian relaxation, a heuristic based on a cut generation process and an exact method by Benders decomposition. Experimental results on real and generated instances are reported.
متن کاملNear optimal and optimal solutions for an integrated employee timetabling and production scheduling problem
This paper deals with integrated employee timetabling and production scheduling problem. At the first level, we have to manage a classical employee timetabling problem. At the second level, we aim at supplying a feasible production schedule for a set of interruptible tasks with qualification requirements and time-windows. Instead of using a hierarchical approach, we try here to integrate the tw...
متن کاملSolving an integrated employee timetabling and production scheduling problem via hybrid branch-and-bound
We propose exact hybrid methods based on integer linear programming and constraint programming for an integrated employee timetabling and production scheduling problem. Each method we investigate uses a constraint programming (CP) formulation associated with a linear programming (LP) relaxation. Under a CP framework, the LP-relaxation is integrated into a global constraint using in addition red...
متن کاملSolving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
We propose exact hybrid methods based on integer linear programming and constraint programming for an integrated employee timetabling and job-shop scheduling problem. Each method we investigate uses a constraint programming (CP) formulation associated with a linear programming (LP) relaxation. Under a CP framework, the LP-relaxation is integrated into a global constraint using in addition reduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2010
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2009.03.013